Minimum Flows in Bipartite Networks with Unit Capacities
نویسندگان
چکیده
In this paper we study minimum flow algorithms in bipartite networks with unit capacities combining the algorithms for minimum flow in bipartite networks with the algorithms for minimum flow in unit capacity networks. Key–Words: Network flows, minimum flow problem, unit capacity networks, bipartite networks, maximum cut.
منابع مشابه
Minimum Cost Flows in Graphs with Unit Capacities
We consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have been developed. In contrast, for maximum flow with unit capacities, the best bounds are proven for slight modifications of classical blocking flow and push-relabel algorithms. In this paper we show that t...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملSublinear-Time Parallel Algorithms for Matching and Related Problems
This paper presents the first sublinear-time deterministic parallel algorithms fix bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to...
متن کاملReducing Directed Max Flow to Undirected Max Flow and Bipartite Matching
In this paper, we prove two new results related to finding maximum flows in directed graphs and finding maximum matchings in bipartite graphs. In our first result, we derive a new algorithm for finding maximum flows in directed graphs. Our algorithm works by reducing a maximum flow problem on a directed graph to a maximum flow problem on an undirected graph, and running the Karger-Levine algori...
متن کاملOn finding paths and flows in multicriteria, stochastic and time-varying networks
Title of dissertation: ON FINDING PATHS AND FLOWS IN MULTICRITERIA, STOCHASTIC AND TIME-VARYING NETWORKS Sathaporn Opasanon, Doctor of Philosophy, 2004 Dissertation directed by: Professor Elise Miller -Hooks Department of Civil and Environmental Engineering This dissertation addresses two classes of network flow problems in networks with multiple, stochastic and time-varying attributes. The fir...
متن کامل